VLSI Implementation of a Cost-Efficient Loeffler DCT Algorithm with Recursive CORDIC for DCT-Based Encoder
نویسندگان
چکیده
This paper presents a low-cost and high-quality, hardware-oriented, two-dimensional discrete cosine transform (2-D DCT) signal analyzer for image video encoders. In order to reduce memory requirement improve quality, novel Loeffler DCT based on coordinate rotation digital computer (CORDIC) technique is proposed. addition, the proposed algorithm realized by recursive CORDIC architecture instead of an unfolded with approximated scale factors. design, fully pipelined developed efficiently increase operating frequency throughput, factors are implemented using four hardware-sharing machines complexity reduction. Thus, computational can be decreased significantly only 0.01 dB loss deviated from optimal quality DCT. Experimental results show that 2-D spectral not achieved superior average peak signal–noise ratio (PSNR) compared previous CORDIC-DCT algorithms but also designed cost-efficient very large integration (VLSI) implementation. The design was UMC 0.18-μm CMOS process synthesized gate count 8.04 k core area 75,100 μm2. Its 100 MHz power consumption 4.17 mW. Moreover, this work had at least 64.1% reduction saved 22.5% in designs.
منابع مشابه
CORDIC based fast algorithm for power-of-two point DCT and its efficient VLSI implementation
—In this paper, we present a coordinate rotation digital computer (CORDIC) based fast algorithm for power-of-two point DCT, and develop its corresponding efficient VLSI implementation. The proposed algorithm has some distinguish advantages, such as regular Cooley-Tukey FFT-like data flow, identical post-scaling factor, and arithmetic-sequence rotation angles. By using the trigonometric formula,...
متن کاملPipelined implementation of AI-based Loeffler DCT
We propose a pipelined implementation of the eight-point Loeffler discrete cosine transform (DCT) for portable applications. The pipelined structure produces one DCT coefficient per clock cycle, which meets the limited memory bandwidth of many portable devices. Twodimensional algebraic integer (AI) encoding and the shift-and-add approach were used to make the implementation multiplication-free....
متن کاملImplementation of Efficient CORDIC Array Structure Based Fast RADIX-2 DCT Algorithm
A modern coordinate rotation digital computer (CORDIC)-based fast radix-2 algorithm for computation of discrete cosine transformation DCT). The planned algorithm has some distinguish advantages, such as Cooley-Tukey fast Fourier transformation (FFT)-like regular data flow, uniform post-scaling factor, in-place computation and arithmetic sequence rotation angles. Compared to existing DCT algorit...
متن کاملGeneric-Precision algorithm for DCT-Cordic architectures
In this paper we propose a generic algorithm to calculate the rotation parameters of CORDIC angles required for the Discrete Cosine Transform algorithm (DCT). This leads us to increase the precision of calculation meeting any accuracy.Our contribution is to use this decomposition in CORDIC based DCT which is appropriate for domains which require high quality and top precision. We then propose a...
متن کاملNovel VLSI Algorithm and Architecture with Good Quantization Properties for a High-Throughput Area Efficient Systolic Array Implementation of DCT
Using a specific input-restructuring sequence, a new VLSI algorithm and architecture have been derived for a high throughput memory-based systolic array VLSI implementation of a discrete cosine transform. The proposed restructuring technique transforms the DCT algorithm into a cycle-convolution and a pseudo-cycle convolution structure as basic computational forms. The proposed solution has been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2021
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics10070862